A Note on Scheduling Problems with Irregular Starting Time Costs
نویسندگان
چکیده
In [9], Maniezzo and Mingozzi study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure, and identify special cases that are solv-able in polynomial time. In this note, we review three previously established, related results which show that the general problem is solvable in polynomial time.
منابع مشابه
On project scheduling with irregular starting time costs
Maniezzo and Mingozzi (Operations Research Letters 25 (1999), pp. 175–182) study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure and they identify special cases that are solvable in polynomial time. In this note, we present a collection of previously establis...
متن کاملDesign of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System
This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...
متن کاملAppling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...
متن کاملResource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)
Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...
متن کاملConcurrent Locomotive Assignment and Freight Train Scheduling
The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000